#define  _CRT_SECURE_NO_WARNINGS

#include "BinaryTree.h"
#include "Queue.h"

int main()
{
	int i = 0;
	int size = 0;
	int k = 3;
	BTDataType* arr = "ABD##E#H##CF##G##";
	BTNode* root = CreateBinaryTree(arr, &i);

	PrevOrder(root);
	printf("\n");

	InOrder(root);
	printf("\n");

	PostOrder(root);
	printf("\n");

	printf("BinaryTreeSize:%d\n", BinaryTreeSize(root));
	printf("BinaryTreeLeafSize:%d\n", BinaryTreeLeafSize(root));
	printf("BinaryTreeKSize:%d\n", BinaryTreeKSize(root, 3));
	printf("BinaryTreeFind:%p\n", BinaryTreeFind(root, 'F'));
	BTNode* pos = BinaryTreeFind(root, 'F');
	pos->val = 'K';
	PrevOrder(root);
	printf("\n");

	LevelOrder(root);
	printf("%d\n", IsCompleteTree(root));

	BinaryTreeDestroy(root);

	return 0;
}